Binomial differentially 4 uniform permutations with high nonlinearity

نویسندگان

  • Carl Bracken
  • Chik How Tan
  • Yin Tan
چکیده

Article history: Received 19 April 2011 Revised 22 November 2011 Accepted 25 November 2011 Available online 9 December 2011 Communicated by Gary McGuire MSC: 94A60 11T71 14G50

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Differentially 4-uniform Permutations over GF(22k) from the Inverse Function Revisited

Constructing S-boxes with low differential uniformity and high nonlinearity is of cardinal significance in cryptography. In the present paper, we show that numerous differentially 4-uniform permutations over F22k can be constructed by composing the inverse function and cycles over F22k . Two sufficient conditions are given, which ensure that the differential uniformity of the corresponding comp...

متن کامل

A new construction of differentially 4-uniform permutations over $F_{2^{2k}}$

Permutations over F22k with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well known example is that the Advanced Encryption Standard (AES) chooses a differentially 4-uniform permutation, the multiplicative inverse function, as its S-box. In this...

متن کامل

Involutory Differentially 4-Uniform Permutations from Known Constructions

Substitution box (S-box) is an important component of block ciphers for providing confusion into the cryptosystems. The functions used as S-boxes should have low differential uniformity, high nonlinearity and high algebraic degree. Due to the lack of knowledge on the existence of APN permutations over F22k , which have the lowest differential uniformity, when k > 3, they are often constructed f...

متن کامل

An equivalent condition on the switching construction of differentially 4-uniform permutations on from the inverse function

Differentially 4-uniform permutations on F22k with high nonlinearity are often chosen as substitution boxes in block ciphers. Recently, Qu et al. used the powerful switching method to construct permutations with low differential uniformity from the inverse function [10], [11] and proposed a sufficient but not necessary condition for these permutations to be differentially 4-uniform. In this pap...

متن کامل

An Equivalent Condition on the Switching Construction of Differentially 4-uniform Permutations on F22k from the Inverse Function

Differentially 4-uniform permutations on F22k with high nonlinearity are often chosen as Substitution boxes in block ciphers. Recently, Qu et al. used the powerful switching method to construct such permutations from the inverse function [9], [10]. More precisely, they studied the functions of the form G(x) = 1 x +f( 1 x ), where f is a Boolean function. They proved that if f is a preferred Boo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2012